Properties of convex hull generated by inhomogeneous Poisson point process
نویسندگان
چکیده
منابع مشابه
SOME FIXED POINT THEOREMS IN LOCALLY CONVEX TOPOLOGY GENERATED BY FUZZY N-NORMED SPACES
The main purpose of this paper is to study the existence of afixed point in locally convex topology generated by fuzzy n-normed spaces.We prove our main results, a fixed point theorem for a self mapping and acommon xed point theorem for a pair of weakly compatible mappings inlocally convex topology generated by fuzzy n-normed spaces. Also we givesome remarks in locally convex topology generate...
متن کاملcontrol of the optical properties of nanoparticles by laser fields
در این پایان نامه، درهمتنیدگی بین یک سیستم نقطه کوانتومی دوگانه(مولکول نقطه کوانتومی) و میدان مورد مطالعه قرار گرفته است. از آنتروپی ون نیومن به عنوان ابزاری برای بررسی درهمتنیدگی بین اتم و میدان استفاده شده و تاثیر پارامترهای مختلف، نظیر تونل زنی(که توسط تغییر ولتاژ ایجاد می شود)، شدت میدان و نسبت دو گسیل خودبخودی بر رفتار درجه درهمتنیدگی سیستم بررسی شده اشت.با تغییر هر یک از این پارامترها، در...
15 صفحه اولConvex Hull Properties of Harmonic Maps
In 1975, Yau [Y] proved, by way of a gradient estimate, that a complete manifold M with non-negative Ricci curvature must satisfy the strong Liouville property for harmonic functions. The strong Liouville property (Liouville property) asserts that any positive (bounded) harmonic function defined on M must be identically constant. In 1980, Cheng [C] generalized the gradient estimate to harmonic ...
متن کاملComputing the convex hull of a planar point set
In Figure 1, the set S consists of thirteen points. The output of a convex hull algorithm should be the list (p1, p2, p3, p4, p5, p6). We remark that the list storing the vertices of CH (S) can start with an arbitrary vertex. In the example, the list (p3, p4, p5, p6, p1, p2) would also be a valid output. ∗School of Computer Science, Carleton University, Ottawa, Ontario, Canada K1S 5B6. E-mail: ...
متن کاملComputing Convex Hull in a Floating Point Arithmetic
We present a numerically stable and time and space complexity optimal algorithm for constructing a convex hull for a set of points on a plane. In contrast to already existing numerically stable algorithms which return only an approximate hull, our algorithm constructs a polygon that is truly convex. The algorithm is simple and easy to implement.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Ufa Mathematical Journal
سال: 2020
ISSN: 2074-1863,2074-1871
DOI: 10.13108/2020-12-3-81